Progress on Poset-free Families of Subsets
نویسندگان
چکیده
Increasing attention is being paid to the study of families of subsets of an nset that contain no subposet P . Especially, we are interested in such families of maximum size given P and n. For certain P this problem is solved for general n, while for other P it is extremely challenging to find even an approximate solution for large n. It is conjectured that for any P , the maximum size is asymptotic to a constant times ( n b 2 c ) , where the constant is a certain integer depending on P . This survey has two purposes. First, we want to bring this exciting line of research to the attention of a wider audience. Second, we want to make experts aware of the broad range of recent progress in the area. 1 First Results: Families Without Chains Problems of forbidding given structures in a larger structure are very popular in extremal combinatorics. The study of forbidden subgraph problems, starting from Mantel’s result on triangle-free graphs, is nowadays a well-developed discipline. The Turán theory on hypergraphs contains beautiful theorems and challenging unsolved problems. A research area that has become fertile in recent years considers forbidding poset structures in families of subsets. Let P = (P,≤) be a finite poset. We say that another poset Q contains P as a subposet (in the weak sense), if there exists an order-preserving injection i from P to Q. We view a family F of subsets of a finite set as a poset itself, ordered according to the inclusion relation of sets. More precisely, working in the Boolean lattice Bn of all 2 subsets of [n] := {1, 2, · · · , n}, ordered by inclusion, we want to understand how large a family of subsets in Bn can be without containing a given poset P as a subposet. We let ( [n] k ) denote the collection of k-subsets of [n]. ∗Department of Mathematics, University of South Carolina, Columbia, SC, USA 29208 ([email protected]). Research supported in part by a grant from the Simons Foundation (#282896 to Jerrold Griggs) and by a long-term visiting position at the IMA, University of Minnesota. †Department of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan 40227 ([email protected]). Supported by Ministry of Science and Technology (No. 103-2115-M-005 -003 -MY2)
منابع مشابه
The partition method for poset-free families
Given a finite poset P , let La(n, P ) denote the largest size of a family of subsets of an n-set that does not contain P as a (weak) subposet. We employ a combinatorial method, using partitions of the collection of all full chains of subsets of the nset, to give simpler new proofs of the known asymptotic behavior of La(n, P ), as n → ∞, when P is the r-fork Vr, the four-element N poset N , and...
متن کاملSet Families with a Forbidden Subposet
We asymptotically determine the size of the largest family F of subsets of {1, . . . , n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner’s theorem. Introduction We say that a poset P is a subposet of a poset P ′ if there is an injective map f : P → P ′ such that a 6P b implies f(a) 6P ′ f(b). A ...
متن کاملOn Families of Subsets With a Forbidden Subposet
Let F ⊂ 2[n] be a family of subsets of {1, 2, . . . , n}. For any poset H, we say F is H-free if F does not contain any subposet isomorphic to H. Katona and others have investigated the behavior of La(n,H), which denotes the maximum size of H-free families F ⊂ 2[n]. Here we use a new approach, which is to apply methods from extremal graph theory and probability theory to identify new classes of...
متن کاملPoset-free families and Lubell-boundedness
Given a finite poset P , we consider the largest size La(n, P ) of a family F of subsets of [n] := {1, . . . , n} that contains no subposet P . This continues the study of the asymptotic growth of La(n, P ); it has been conjectured that for all P , π(P ) := limn→∞ La(n, P )/ ( n b 2 c ) exists and equals a certain integer, e(P ). This is known to be true for paths, and for several more general ...
متن کاملDiamond-free families
Given a finite poset P , we consider the largest size La(n, P ) of a family of subsets of [n] := {1, . . . , n} that contains no (weak) subposet P . This problem has been studied intensively in recent years, and it is conjectured that π(P ) := limn→∞ La(n, P )/ ( n b 2 c ) exists for general posets P , and, moreover, it is an integer. For k ≥ 2 let Dk denote the k-diamond poset {A < B1, . . . ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015